Efficiency and Fairness in Distributed Wireless Networks Through Self-interference Cancellation and Scheduling
نویسندگان
چکیده
Handling interference is one of the major challenges in the design of multi-user distributed wireless systems. In current systems, interference is managed through carrier sensing mechanisms such as CSMA/CA and through MAC algorithms based on random back-off. However, the asymmetry in channel sensing inevitably causes degraded throughput and fairness issues, such as those caused by hidden terminal problems. We propose ContraFlow, a solution based on self-interference cancellation and innovative scheduling mechanisms that increases spatial reuse, eliminates hidden terminals, and rectifies decentralized coordination inefficiencies among nodes, thereby improving fairness. Self-interference cancellation is a technique allowing a node to cancel its own transmitted signal and hence to successfully receive data while transmitting on the same channel. We demonstrate the feasibility of such techniques in a low power WPAN setting, using Lyrtech software-defined radios. Self-interference cancellation repairs carrier sensing, making it possible to successfully eliminate hidden terminal problems, even when using current multi-user MAC protocols; but it also provides the opportunity to design new distributed MAC scheduling algorithms that increase the spatial reuse and solve most of the fairness problems associated with current algorithms. We use simulations to illustrate the performance gains achieved when ContraFlow is used and we obtain both a throughput increase over current systems, as well as a significant improvement in fairness.
منابع مشابه
MIMO Link Scheduling for Interference Cancellation in Dense Wireless Networks
This paper addresses the problem of fair scheduling of MIMO links in dense wireless network deployments where MIMO interference cancellation is carried out to optimize network performance. We formulate and solve an optimal MIMO link scheduling problem, where the goal is to maximize aggregate throughput while meeting a specified fairness criterion. Evaluations in a modified version of ns-3 show ...
متن کاملOn Joint Sub-channel Allocation, Duplexing Mode Selection, and Power Control in Full-Duplex Co-Channel Femtocell Networks
As one of the promising approaches to increase the network capacity, Full-duplex (FD) communications have recently gained a remarkable attention. FD communication enables wireless nodes to simultaneously send and receive data through the same frequency band. Thanks to the recent achievements in the self-interference (SI) cancellation, this type of communication is expected to be potentially uti...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملA Distributed Algorithm for Optimal Throughput and Fairness in Wireless Networks with a General Interference Model
In multi-hop wireless networks, earlier research on joint scheduling and congestion control has suggested that MAClayer scheduling is the bottleneck. Distributed scheduling for maximal throughput is difficult since the conflicting relationship between different links is complex. Existing works on maximalthroughput scheduling usually assumes synchronized time slots, and in each slot, a maximal-w...
متن کاملAssessment of DSACC and QPART Algorithms in Ad Hoc Networks
The rapid advancement in wireless over wired has augmented the need for improving theQuality of Service (QoS) over such wireless links. However, the wireless ad hoc networkshave too low bandwidth, and establishing a QoS in these networks is a difficult issue. So,support of quality of service in ad hoc networks is the topical issue among the networkscience researchers. In this research we are go...
متن کامل